Higher moments for lattice point discrepancy of convex domains and annuli
نویسندگان
چکیده
Given a domain $\Omega \subseteq \mathbb{R}^2$, let $\mathcal{D}(\Omega,x,R)$ be the number of lattice points from $\mathbb{Z}^2$ in $R\Omega-x$, for $R \ge 1$ and $x\in \mathbb{T}^2$, minus area $R\Omega$: $$\mathcal{D}(\Omega,x,R) = \# \{ (j,k) \in \mathbb{Z}^2 :(j-x_1,k-x_2) R\Omega \} - R^2|\Omega|.$$ We call $\int_{\mathbb{T}^2}|\mathcal{D}(\Omega,x,R)|^pdx$ $p$-th moment discrepancy function $\mathcal{D}$. In 2014, Huxley showed that convex domains with sufficiently smooth boundary, fourth $\mathcal{D}$ is bounded by $\mathcal{O}(R^2\log R)$, 2019, Colzani, Gariboldi Gigante extended this result to higher dimensions. paper, our contribution twofold: first, we present simple direct proof Huxley's 2014 result; second, establish new estimates moments point annuli radius $R$, any fixed thickness $0<t<1$ $p\ge 2.$
منابع مشابه
Mean Lattice Point Discrepancy Bounds, Ii: Convex Domains in the Plane
We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.
متن کاملDiscrepancy of higher rank polynomial lattice point sets
Polynomial lattice point sets (PLPSs) (of rank 1) are special constructions of finite point sets which may have outstanding equidistribution properties. Such point sets are usually required as nodes in quasi-Monte Carlo rules. Any PLPS is a special instance of a (t,m, s)-net in base b as introduced by Niederreiter. In this paper we generalize PLPSs of rank 1 to what we call then PLPSs of rank r...
متن کاملConcave Convex-Body Functionals and Higher Order Moments-of-Inertia
A class < of convex bodies (c-bodies) P,Q, . . . in a k-dimensional Euclidean space R is called convex, when for all P,Q ∈ < always follows αP × βQ ∈ < [α, β ≥ 0, α+ β = 1]. Here we interpret λP (with λ > 0) to be a c-body, obtained from P through a dilatation with respect to a fixed originO of the spaceR; P ×Q refers to Minkowski addition. This property of a class of c-bodies thus not only ref...
متن کاملConvex sublattices of a lattice and a fixed point property
The collection CL(T ) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f ∶ T → CL(T ) has a fixed point, that is x ∈ f(x) for some x ∈ T . We examine which lattices may have CLFPP. We introduce the selection property for convex sublattices (CLSP);...
متن کاملThe Method of Moments for Higher Moments { Problems , Solutions , and
Though often not explicitly stated, the method of moments is one of the heavily used methods in queueing analysis. A typical, tagged customer is traced as it proceeds through the system and the components of its delay are individually analyzed. Using the moments of these components, moments of the sojourn and waiting times of an arbitrary customer can be derived. By this method, expected values...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2022
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2021.03.030